Lattice Embeddings into the R . E . Degrees Preserving 0 and 1
نویسندگان
چکیده
We show that a nite distributive lattice can be embedded into the r.e. degrees preserving least and greatest element i the lattice contains a join-irreducible noncappable element.
منابع مشابه
Lattice Embeddings into the R . E . Degrees Preserving 0 and 1 Klaus Ambos - Spies
We show that a finite distributive lattice can be embedded into the r.e. degrees preserving least and greatest element if and only if the lattice contains a join-irreducible noncappable element.
متن کاملA classification of hull operators in archimedean lattice-ordered groups with unit
The category, or class of algebras, in the title is denoted by $bf W$. A hull operator (ho) in $bf W$ is a reflection in the category consisting of $bf W$ objects with only essential embeddings as morphisms. The proper class of all of these is $bf hoW$. The bounded monocoreflection in $bf W$ is denoted $B$. We classify the ho's by their interaction with $B$ as follows. A ``word'' is a function ...
متن کاملEmbedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high, but not superhigh, c.e. degrees. Recent research shows that the notion of superhighness is closely related to algorithmic randomness and effective measure theory. Jockusch and Mohrherr proved in [4] that the diamond ...
متن کاملEmbedding Lattices with Top Preserved Below Non-GL2 Degrees
A minimal degree not realizing least possible jump. A recursively enumerable degree that is not the top of a diamond in the Turing degrees. 18 6] Peter A. Fejer and Richard A. Shore. Embeddings and extensions of embeddings in the r.e. tt-and wtt-degrees. 17 Corollary 8 If a is not in GL 2 , then any nontrivial recursively presented lattice can be embedded (as a lattice) into D (a) preserving le...
متن کاملMathematical Logic A superhigh diamond in the c.e. t t-degrees
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by (Mohrherr in Z Math Logik Grundlag Math 32: 5–12, 1986) where she proved the existence of incomplete superhigh c.e. degrees, and high, but not superhigh, c.e. degrees. Recent research shows that the notion of superhighness is closely related to algorithmic randomness and effective measure theory. Jockusch and M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014